package leetcode;

import java.util.ArrayList;
import java.util.List;

/**
 * @program: datastructureandalogorithm
 * @description:
 * @author: hmx
 * @create: 2022-03-12 00:11
 **/
public class LeetCode589 {

    /*public List<Integer> preorder(Node root) {
        List<Integer> ans = new ArrayList<>();
        recur(root, ans);
        return ans;
    }

    void recur(Node root, List<Integer> ans) {
        if (root != null) {
            ans.add(root.val);
            for (Node ch : root.children) {
                recur(ch, ans);
            }
        }
    }*/

}
